Piecewise cubic curve-fitting algorithm

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Piecewise Cubic Curve Fitting Algorithm

We give a piecewise cubic curve fitting algorithm which preserves monotonicity of the data. The algorithm has a higher order of convergence than the Fritsch-Carlson algorithm and is simpler than the Eisenstat-Jackson-Lewis algorithm.

متن کامل

A fast algorithm for cubic B-spline curve fitting

Based on the matrix perturbation technique. a fast-fitting algorithm using uniform cubic B-spline curves is presented. Our algorithm entails much less floating-point operations when compared with Gaussian elimination method. In addition, our result can be applied to solve the closed cubic B-spline curve-fitting problem. Experimental results are included for a practical version. These experiment...

متن کامل

Error analysis for piecewise quadratic curve fitting algorithms

We analyze the convergence of piecewise quadratic curve fitting algorithms which preserve geometric properties of the data such as monotonicity and convexity. In the process, we suggest two new algorithms which improve the order of convergence of existing algorithms.

متن کامل

Image Restoration Using Piecewise Iterative Curve Fitting and Texture Synthesis

In this paper, we present a novel scheme for parsing images into medium level vision representation: contour curve and region texture. This scheme is integrated with piecewise iterative curve fitting and texture synthesis, in which an original image is analyzed at the representation side so as to obtain contours and local texture exemplars. The contour of each region will be processed piecewise...

متن کامل

Algorithm - Adapt, Adaptive Smooth Curve Fitting

This paper describes a fast and reliable algorithm which computes smooth piecewise polynomial approximations to functions. It adaptively locates the knots by a procedure that has been shown to provide the optimal rate of convergence as the accuracy requirements (and number of knots) increase. Local Hermite interpolation is used which requires that derivatives of the function be known (or estima...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1987

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-1987-0890262-0